Notes on the Polynomial Freiman-ruzsa Conjecture
نویسندگان
چکیده
Let G be an abelian group. The Polynomial Freiman-Ruzsa conjecture (PFR) concerns the structure of sets A ⊆ G for which |A + A| 6 K|A|. These notes provide proofs for the statements made in §10 of [8], and as such constitute a reasonably detailed discussion of the PFR in the case G = F2 . Although the purpose of these notes is to furnish proofs for the statements in §10 of [8], they are reasonably self-contained. For further context see the article [8] itself. A great deal of the material in this section was communicated to me in person by Imre Ruzsa, and is reproduced here with his kind permission.
منابع مشابه
A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture in Euclidean space
The Polynomial Freiman-Ruzsa conjecture is one of the central open problems in additive combinatorics. It speculates tight quantitative bounds between combinatorial and algebraic notions of approximate subgroups. In this note, we restrict our attention to subsets of Euclidean space. In this regime, the original conjecture considers approximate algebraic subgroups as the set of lattice points in...
متن کاملAn Exposition of Sanders' Quasi-Polynomial Freiman-Ruzsa Theorem
The polynomial Freiman-Ruzsa conjecture is one of the most important conjectures in additive combinatorics. It asserts that one can switch between combinatorial and algebraic notions of approximate subgroups with only a polynomial loss in the underlying parameters. This conjecture has also found several applications in theoretical computer science. Recently, Tom Sanders proved a weaker version ...
متن کاملThe Freiman-Ruzsa Theorem in Finite Fields
Let G be a finite abelian group of torsion r and let A be a subset of G. The Freiman-Ruzsa theorem asserts that if |A + A| ≤ K|A| then A is contained in a coset of a subgroup of G of size at most Kr 4 |A|. It was conjectured by Ruzsa that the subgroup size can be reduced to r for some absolute constant C ≥ 2. This conjecture was verified for r = 2 in a sequence of recent works, which have, in f...
متن کاملEquivalence of polynomial conjectures in additive combinatorics
We study two conjectures in additive combinatorics. The first is the polynomial Freiman-Ruzsa conjecture, which relates to the structure of sets with small doubling. The second is the inverse Gowers conjecture for U3, which relates to functions which locally look like quadratics. In both cases a weak form, with exponential decay of parameters is known, and a strong form with only a polynomial l...
متن کاملAn additive combinatorics approach to the log-rank conjecture in communication complexity
For a {0, 1}-valued matrixM let CC(M) denote the deterministic communication complexity of the boolean function associated with M . The log-rank conjecture of Lovász and Saks [FOCS 1988] states that CC(M) ≤ logc(rank(M)) for some absolute constant c where rank(M) denotes the rank of M over the field of real numbers. We show that CC(M) ≤ c · rank(M)/ log rank(M) for some absolute constant c, ass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013